|
__NOTOC__ In mathematics, a De Morgan algebra (named after Augustus De Morgan, a British mathematician and logician) is a structure ''A'' = (A, ∨, ∧, 0, 1, ¬) such that: * (''A'', ∨, ∧, 0, 1) is a bounded distributive lattice, and * ¬ is a De Morgan involution: ¬(''x'' ∧ ''y'') = ¬''x'' ∨ ¬''y'' and ¬¬''x'' = ''x''. (i.e. an involution that additionally satisfies De Morgan's laws) In a De Morgan algebra, the laws * ¬''x'' ∨ ''x'' = 1 (law of the excluded middle), and * ¬''x'' ∧ ''x'' = 0 (law of noncontradiction) do not always hold. In the presence of the De Morgan laws, either law implies the other, and an algebra which satisfies them becomes a Boolean algebra. Remark: It follows that ¬( x∨y) = ¬x∧¬y, ¬1 = 0 and ¬0 = 1 (e.g. ¬1 = ¬1∨0 = ¬1∨¬¬0 = ¬(1∧¬0) = ¬¬0 = 0). Thus ¬ is a dual automorphism. If the lattice is defined in terms of the order instead, i.e. (A, ≤) is a bounded partial order with a least upper bound and greatest lower bound for every pair of elements, and the meet and join operations so defined satisfy the distributive law, then the complementation can also be defined as an involutive anti-automorphism, that is, a structure ''A'' = (A, ≤, ¬) such that: * (A, ≤) is a bounded distributive lattice, and * ¬¬''x'' = ''x'', and * ''x'' ≤ ''y'' → ¬''y'' ≤ ¬''x''. De Morgan algebras were introduced by Grigore Moisil around 1935.〔 although without the restriction of having a 0 and an 1. They were then variously called quasi-boolean algebras in the Polish school, e.g. by Rasiowa and also distributive ''i''-lattices by J. A. Kalman.〔 (''i''-lattice being an abbreviation for lattice with involution.) They have been further studied in the Argentian algebraic logic school of Antonio Monteiro.〔〔 De Morgan algebras are important for the study of the mathematical aspects of fuzzy logic. The standard fuzzy algebra ''F'' = ((), max(''x'', ''y''), min(''x'', ''y''), 0, 1, 1 − ''x'') is an example of a De Morgan algebra where the laws of excluded middle and noncontradiction do not hold. Another example is Dunn's 4-valued logic, in which ''false'' < ''neither-true-nor-false'' < ''true'' and ''false'' < ''both-true-and-false'' < ''true'', while ''neither-true-nor-false'' and ''both-true-and-false'' are not comparable.〔 == Kleene algebra == If a De Morgan algebra additionally satisfies ''x'' ∧ ¬''x'' ≤ ''y'' ∨ ¬''y'', it is called a Kleene algebra.〔〔 (This notion should not to be confused with the other Kleene algebra generalizing regular expressions.) This notion has also been called a normal ''i''-lattice by Kalman. Examples of Kleene algebras in the sense defined above include: lattice-ordered groups, Post algebras and Łukasiewicz algebras.〔 Boolean algebras also meet this definition of Kleene algebra. The simplest Kleene algebra that is not Boolean is Kleene's three-valued logic K3. K3 made its first appearance in Kleene's ''On notation for ordinal numbers'' (1938).〔http://www.jstor.org/stable/2267778〕 The algebra was named after Kleene by Brignole and Monteiro.〔Brignole, D. and Monteiro, A. (Caracterisation des algebres de Nelson par des egalites ), Notas de Logica Matematica, Instituto de Matematica Universidad del sur Bahia Blanca 20 (1964) A (possibly abbreviated) version of this paper appeared later in Proc. Acad. Japan 〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「De Morgan algebra」の詳細全文を読む スポンサード リンク
|